Capacity Bounds for Broadcast Channels With Confidential Messages

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Broadcast channels with confidential messages

Absrfucr-Given two discrete memoryless channels @MC’s) with a common input, it is desired to transmit private messagea to receiver 1 at r&R, andcommon meswgea to both receivers at rate R,, while keeping receiver 2 as ignorant of tbe private messages as possible. Measurhg ignorance by equivocation, a single-letter characterization is given of the. achievable trfplea (RI&R,-,) where 4 is the equi...

متن کامل

Capacity Results for Relay Channels with Confidential Messages

We consider a communication system where a relay helps transmission of messages from a sender to a receiver. The relay is considered not only as a helper but as a wire-tapper who can obtain some knowledge about transmitted messages. In this paper we study a relay channel with confidential messages(RCC), where a sender attempts to transmit common information to both a receiver and a relay and al...

متن کامل

Discrete Memoryless Interference and Broadcast Channels with Confidential Messages

Discrete memoryless interference and broadcast channels in which independent confidential messages are sent to two receivers are considered. Confidential messages are transmitted to each receiver with perfect secrecy, as measured by the equivocation at the other receiver. In this paper, we derive inner and outer bounds for the achievable rate regions for these two communication systems.

متن کامل

Relay Channels with Confidential Messages

We consider a relay channel where a relay helps the transmission of messages from one sender to one receiver. The relay is considered not only as a sender that helps the message transmission but as a wire-tapper who can obtain some knowledge about the transmitted messages. In this paper we study the coding problem of the relay channel under the situation that some of transmitted messages are co...

متن کامل

Capacity Bounds for State-Dependent Broadcast Channels

In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprises a sender broadcasting two independent messages to two non-cooperating receivers; for channels of the second class, each receiver is given the message it need n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2009

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2009.2027500